Genome Halving by Block Interchange
نویسندگان
چکیده
We address the problem of finding the minimal number of block interchanges (exchange of two intervals) required to transform a duplicated linear genome into a tandem duplicated linear genome. We provide a formula for the distance as well as a polynomial time algorithm for the sorting problem.
منابع مشابه
Genome Halving with Double Cut and Join
The genome halving problem, previously solved by El-Mabrouk for inversions and reciprocal translocations, is here solved in a more general context allowing transpositions and block interchange as well, for genomes including multiple linear and circular chromosomes. We apply this to several datasets and compare the results to the previous algorithm.
متن کاملSingle Tandem Halving by Block Interchange
We address the problem of finding the minimal number of block interchanges required to transform a duplicated unilinear genome into a single tandem duplicated unilinear genome. We provide a formula for the distance as well as a polynomial time algorithm for the sorting problem. This is the revised and extended version of [8].
متن کاملar X iv : 1 10 7 . 10 76 v 1 [ cs . D S ] 6 J ul 2 01 1 Genome Halving by Block Interchange
We address the problem of finding the minimal number of block interchanges (exchange of two intervals) required to transform a duplicated linear genome into a tandem duplicated linear genome. We provide a formula for the distance as well as a polynomial time algorithm for the sorting problem.
متن کاملImproving the Performance of a Genome Sorting Algorithm with Inverted Block-Interchange
A classic problem in comparative genomics is to find a shortest sequence of evolutionary operations that transform one genome into another. There are different types of genome rearrangement operators such as reversals, transpositions, translocations, block interchange, double cut and join (DCJ) etc. In this paper we consider reversals and block-interchanges simultaneously and incorporate invert...
متن کاملThe Problem of Chromosome Reincorporation in DCJ Sorting and Halving
We study two problems in the double cut and join (DCJ) model: sorting – transforming one multilinear genome into another and halving – transforming a duplicated genome into a perfectly duplicated one. The DCJ model includes rearrangement operations such as reversals, translocations, fusions and fissions. We can also mimic transpositions or block interchanges by two operations: we extract an app...
متن کامل